Mapping interconnection networks into VEDIC networks - Parallel Processing Symposium, 1993., Proceedings of Seventh International

نویسندگان

  • VIPIN CHAUDHARY
  • BIKASH SABATA
چکیده

We show the universality of the VEDIC network in simulating other well known interconnection networks b y generating the parameters of the VEDtC network automatically. Algorithms are given to represent chordal rings, toroidal meshes, binary hypercubes, kary n-cubes, and Cayley graphs star graph and pancake graph, as VEDIC networks. Using these parameters the VEDIC network can be used as a tool for generating currently known and new interconnection networks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conflict-free star-access in parallel memory systems

We study conflict-free data distribution schemes in parallel memories in multiprocessor system architectures. Given a host graph G, the problem is to map the nodes of G into memory modules such that any instance of a template type T in G can be accessed without memory conflicts. A conflict occurs if two or more nodes of T are mapped to the same memory module. The mapping algorithm should (i) be...

متن کامل

Parallel Architectures : Design and E cient Use ?

In this paper we want to demonstrate the large impact of theoretical considerations on the design and eecient use of parallel machines. We describe interconnection networks for parallel computers, tools for their eecient use (mapping, load balancing) and the parallelization of a problem which is hard to parallelize (chess programming).

متن کامل

Mapping algorithms for permutation networks*

The mapping problem arises when the dependency structure of a parallel algorithm differs from the interconnection of processors in the intended parallel computer (topological variation) or, when the number of processes required by the algorithm exceeds the number of processors available in the computer (cardinality variation). The problem discussed in this paper is to identify a distributed com...

متن کامل

Optical Interconnections in Parallel Radar Signal Processing Systems

Optical interconnection networks is a promising design alternative for future parallel computer systems. Numerous configurations with different degrees of optics, optoelectronics, and electronics have been proposed. In this paper, some of these interconnection networks and technologies are briefly surveyed. Also, a discussion of their suitability in radar signal processing systems is provided, ...

متن کامل

Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry

The star and pancake networks were recently proposed as attractive alternatives to the hypercube topology for interconnecting processors in a parallel computer. However, few parallel algorithms are known for these networks. In this paper, we present several data communication schemes and basic algorithms for these two networks. These algorithms are then used to develop parallel solutions to var...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008